An iterated local search algorithm for the single-vehicle cyclic inventory routing problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

We generalize the standard vehicle routing problem with time windows by allowing both traveling times and traveling costs to be time-dependent functions. In our algorithm, we use a local search to determine routes of the vehicles. When we evaluate a neighborhood solution, we must compute an optimal time schedule of each route. We show that this subproblem can be efficiently solved by dynamic pr...

متن کامل

An Efficient Iterated Local Search Algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

This paper deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). A procedure based on the Iterated Local Search (ILS) metaheuristic that uses the Variable Neighborhood Descent (VND) method for performing the local search is proposed. According to literature, the most successful algorithms for the VRPSPD are pure or hybrid versions of the Tabu Search metaheuristi...

متن کامل

An iterated local search algorithm for the vehicle routing problem with convex time penalty functions

We proposed an iterated local search algorithm for the vehicle routing problem with capacity and time window constraints in [1]. We conducted some computational experiments to evaluate the proposed algorithm. The algorithm was coded in C language and run on an IBM-compatible PC (Intel Pentium 4, 2.8 GHz, 1 GB memory). We used the following benchmark instances: (1) Solomon’s benchmark instances ...

متن کامل

An Exact Algorithm for the Single-vehicle Cyclic Inventory Routing Problem

The single-vehicle cyclic inventory routing problem (SV − CIRP ) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer that is selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each...

متن کامل

An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows

Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2014

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2014.02.020